Unit Distance Graphs and Algebraic Integers
نویسندگان
چکیده
منابع مشابه
Distance Graphs on the Integers
We consider several extremal problems concerning representations of graphs as distance graphs on the integers. Given a graph G = (V, E), we wish to find an injective function φ : V → Z = {1, 2, . . . } and a set D ⊂ Z such that {u, v} ∈ E if and only if |φ(u)− φ(v)| ∈ D. Let s(n) be the smallest N such that any graph G on n vertices admits a representation (φG,DG) such that φG(v) ≤ N for all v ...
متن کاملAlgebraic Distance on Graphs
Abstract. Measuring the connection strength between a pair of vertices in a graph is one of the most vital concerns in many graph applications. Simple measures such as edge weights may not be sufficient for capturing the local connectivity. In this paper, we consider an iterative process that smoothes an associated value for nearby vertices, and present a measure of the connection strength (cal...
متن کاملAlgebraic Distance Graphs and Rigidity
An algebraic distance graph is defined to be a graph with vertices in En in which two vertices are adjacent if and only if the distance between them is an algebraic number. It is proved that an algebraic distance graph with finite vertex set is complete if and only if the graph is "rigid". Applying this result, we prove that ( 1 ) if all the sides of a convex polygon T which is inscribed in a c...
متن کاملAlgebraic distance in algebraic cone metric spaces and its properties
In this paper, we prove some properties of algebraic cone metric spaces and introduce the notion of algebraic distance in an algebraic cone metric space. As an application, we obtain some famous fixed point results in the framework of this algebraic distance.
متن کاملOn -unit distance graphs
We consider a variation on the problem of determining the chromatic number of the Euclidean plane and define the -unit distance graph to be the graph whose vertices are the points of E, in which two points are adjacent whenever their distance is within of 1. For certain values of we are able to show that the chromatic number is exactly seven. For some smaller values we show the chromatic number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2019
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-019-00152-4